Location:
Search - minimum energy
Search list
Description: 对wave文件进行读取，并提取短时平均能量，过零率，短时平均幅值值，音频中每一帧的最大值，最小值-right wave to read documents and extract short-term average energy, the zero-rate, short-term value of the average amplitude, Audio each frame of the maximum, minimum
Platform: |
Size: 46527 |
Author: daisiguang |
Hits:
Description: 有限元分析作业源码, piecewise单元,积分 高斯近似算法两种，并计算最小势能-Finite Element Analysis Operating source, piecewise unit, integral Gaussian approximation algorithm for two, and calculation of minimum potential energy
Platform: |
Size: 1406 |
Author: foolboy007 |
Hits:
Description: Hopfield 网——擅长于联想记忆与解迷路 实现H网联想记忆的关键，是使被记忆的模式样本对应网络能量函数的极小值。 设有M个N维记忆模式，通过对网络N个神经元之间连接权 wij 和N个输出阈值θj的设计，使得: 这M个记忆模式所对应的网络状态正好是网络能量函数的M个极小值。 比较困难，目前还没有一个适应任意形式的记忆模式的有效、通用的设计方法。 H网的算法 1）学习模式——决定权重 想要记忆的模式，用-1和1的2值表示 模式：-1，-1，1，-1，1，1，... 一般表示： 则任意两个神经元j、i间的权重： wij=∑ap(i)ap(j)，p=1…p； P：模式的总数 ap(s)：第p个模式的第s个要素（-1或1） wij：第j个神经元与第i个神经元间的权重 i = j时，wij=0，即各神经元的输出不直接返回自身。 2)想起模式： 神经元输出值的初始化 想起时，一般是未知的输入。设xi(0)为未知模式的第i个要素（-1或1） 将xi(0)作为相对应的神经元的初始值，其中，0意味t=0。 反复部分：对各神经元，计算： xi (t+1) = f (∑wijxj（t）-θi), j=1…n, j≠i n—神经元总数 f（）--Sgn（） θi—神经元i发火阈值 反复进行，直到各个神经元的输出不再变化。-Hopfield network -- good at associative memory solution with the realization of lost H associative memory networks, are key to bringing the memory model samples corresponding network energy function of the minimum. With M-N-dimensional memory model, the network N neurons connect between right wij and N output threshold j design makes : M-mode memory corresponding to the network is a state network energy function is the M-000 minimum. More difficult, it is not an arbitrary form of adaptation memory model of effective, common design methods. H network algorithm 1) mode of learning -- decision weights want memory model, with 1 and 2 of the value of a model, said : -1, 1, 1, 1 ,1,1, ... in general : two were arbitrary neuron j i weights between : wij ap = (i) ap (j), p = 1 ... p; P : The tot
Platform: |
Size: 11421 |
Author: 韵子 |
Hits:
Description: Hopfield 网——擅长于联想记忆与解迷路 实现H网联想记忆的关键，是使被记忆的模式样本对应网络能量函数的极小值。 设有M个N维记忆模式，通过对网络N个神经元之间连接权 wij 和N个输出阈值θj的设计，使得: 这M个记忆模式所对应的网络状态正好是网络能量函数的M个极小值。 比较困难，目前还没有一个适应任意形式的记忆模式的有效、通用的设计方法。 H网的算法 1）学习模式——决定权重 想要记忆的模式，用-1和1的2值表示 模式：-1，-1，1，-1，1，1，... 一般表示： 则任意两个神经元j、i间的权重： wij=∑ap(i)ap(j)，p=1…p； P：模式的总数 ap(s)：第p个模式的第s个要素（-1或1） wij：第j个神经元与第i个神经元间的权重 i = j时，wij=0，即各神经元的输出不直接返回自身。 2)想起模式： 神经元输出值的初始化 想起时，一般是未知的输入。设xi(0)为未知模式的第i个要素（-1或1） 将xi(0)作为相对应的神经元的初始值，其中，0意味t=0。 反复部分：对各神经元，计算： xi (t+1) = f (∑wijxj（t）-θi), j=1…n, j≠i n—神经元总数 f（）--Sgn（） θi—神经元i发火阈值 反复进行，直到各个神经元的输出不再变化。-Hopfield network-- good at associative memory solution with the realization of lost H associative memory networks, are key to bringing the memory model samples corresponding network energy function of the minimum. With M-N-dimensional memory model, the network N neurons connect between right wij and N output threshold j design makes : M-mode memory corresponding to the network is a state network energy function is the M-000 minimum. More difficult, it is not an arbitrary form of adaptation memory model of effective, common design methods. H network algorithm 1) mode of learning-- decision weights want memory model, with 1 and 2 of the value of a model, said :-1, 1, 1, 1 ,1,1, ... in general : two were arbitrary neuron j i weights between : wij ap = (i) ap (j), p = 1 ... p; P : The tot
Platform: |
Size: 11264 |
Author: 韵子 |
Hits:
Description: 对wave文件进行读取，并提取短时平均能量，过零率，短时平均幅值值，音频中每一帧的最大值，最小值-right wave to read documents and extract short-term average energy, the zero-rate, short-term value of the average amplitude, Audio each frame of the maximum, minimum
Platform: |
Size: 61440 |
Author: daisiguang |
Hits:
Description: 有限元分析作业源码, piecewise单元,积分 高斯近似算法两种，并计算最小势能-Finite Element Analysis Operating source, piecewise unit, integral Gaussian approximation algorithm for two, and calculation of minimum potential energy
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 用VC编写的彩色图像处理程序，实现了：提取图像中平均、最大、最小灰度，在此基础上可以对图像二值化；可以进行图像边缘提取（有laplace1、laplace2、Robot的提取方法）
；对图像进行卷积滤波（高能滤波，水平、垂直、双向增强，低通滤波）；实现的图像的：锐化、浮雕、反相、平滑化、霓虹、马赛克、柔化、曝光过度，扩散处理。是学习VC彩图处理不可多得的代码。-VC prepared using color image processing procedures, to achieve: the extraction of images the average, maximum and minimum gray-scale, on this basis can the image binarization image edge extraction can be carried out (have laplace1, laplace2, Robot extraction method) image convolution filtering (high-energy filter, horizontal, vertical, two-way enhanced, low-pass filter) realize image: Sharpen, Emboss, RP, smooth, and neon, mosaic, blur, over-exposure, the proliferation of treatment. VC deal is to learn from rare color code.
Platform: |
Size: 124928 |
Author: 杜红艳 |
Hits:
Description: 用于心电信号检测，包括RR波形检测，ＱＲＳ检测，能量检测模的最大值最小值-ECG for detection, including the RR wave detection, QRS detection, energy detection module Maximum Minimum
Platform: |
Size: 106496 |
Author: 白洁 |
Hits:
Description: 介绍了集成温度传感器AD590，给出了AD590测量热力学温度、摄氏温度、两点温度差、多点最低温度、多点平均温度的具体电路，并以节能型温、湿度控制系统为例介绍了利用AD590测两点温差电路的应用。-Introduced an integrated temperature sensor AD590, given AD590 measuring thermodynamic temperature, Celsius temperature, two temperature difference, multi-point minimum temperature, average temperature of the specific multi-point circuits, and to energy-efficient temperature and humidity control system as an example, introduced the use of two AD590 temperature measurement circuit applications.
Platform: |
Size: 32768 |
Author: simon |
Hits:
Description: 有限体积法及其在边值问题中的应用本文介绍了极小位能原理、虚功原理和Ritz-Galerkin方法．主要讨论了椭圆型方程定解问题的有限体积法和双曲型方程定解问题的有限体积法，简要说明了椭圆型方程定解问题的有限体积法的收敛性和近似解误差估计．另外，针对矩形域上一个泊松方程的具体定解问题，导出了它的一种特殊有限体积格式，并且编程实现，计算出该泊松方程定解问题的数值解，将算出的数值解与问题的精确解进行了简单比较，得到了初步的结论．在具体例子中用的是一种特殊的有限体积格式，它可以化为五点差分格式，它比较简单，但有很大的局限性，在边界很规则的情况下使用效果比较好，当边界不规则时，五点差分格式的误差就比较大．一般情况的有限体积法在本文没有太多涉及．-Finite volume method
and its application in the problem for determining solution
The thesis introduced principal of minimum potential energy , principle of virtual work and Ritz-Galerkin method. It is mainly discussed finite volume method of problem for determining solution of elliptic equation and of hyperbolic equation. It is briefly stated that the convergence and error of numerical solutions for elliptic equation. Besides that, it is derived that a special scheme of finite volumn for solving the poisson equation in the rectangle domain, and is obtained the numerical solution by programming. After that, I compared the excise solution with the numerical solution, and came to a simple conclusion. This five point scheme is deduced in the thesis, though it’s simple, it has its limit. It works well when the boundary is regular and its error become large when the boundary is irregular. The thesis hasn’t dealt with finite volumn method in general condition.
Platform: |
Size: 2048 |
Author: 刘小宝 |
Hits:
Description: 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e-ΔE/(kT)，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对当前解重复“产生新解→计算目标函数差→接受或舍弃”的迭代，并逐步衰减t值，算法终止时的当前解即为所得近似最优解，这是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。退火过程由冷却进度表(Cooling
Schedule)控制，包括控制参数的初值t及其衰减因子Δt、每个t值时的迭代次数L和停止条件S。 -Simulated annealing algorithm derived from the theory of solid annealing, the solid heat to full high and let it slowly cooling, heating, the temperature rise inside the solid particles with the shape into disorder, which can be increased gradually while slowly cooling particles increasingly ordered, the temperature has reached equilibrium in each state, and finally reached the ground state at room temperature, which can be reduced to minimum. According to Metropolis criterion, particles tend to equilibrium at a temperature T, the probability e-ΔE/(kT), where E is the temperature T, internal energy, ΔE change its volume, k the Boltzmann constant. Simulated annealing with a solid portfolio optimization problem, the internal energy E is modeled as the objective function value f, temperature T evolved into control parameter t, which are solutions of combinatorial optimization problems of the simulated annealing algorithm: the initial solution from the initial value of t i and the control
Platform: |
Size: 5120 |
Author: leansmall |
Hits:
Description: 试验中使用模拟退火算法寻找一6-单元网络能量最小化的模型。模拟退火算法是模拟物理学上的退火技术。其优势在于有可能使系统从局部极小值跳出。-Simulated annealing algorithm used in the experiments to find a 6- unit network model of energy minimization. Simulated annealing algorithm simulates the physics of annealing. The advantage is likely to make the system jump from local minimum.
Platform: |
Size: 14336 |
Author: 王瑶 |
Hits:
Description: 在一个果园里，多多已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。 每一次合并，多多可以把两堆果子合并到一起，消耗的体力等于两堆果子的重量之和。可以看出，所有的果子经过n-1次合并之后，就只剩下一堆了。多多在合并果子时总共消耗的体力等于每次合并所耗体力之和。 因为还要花大力气把这些果子搬回家，所以多多在合并果子时要尽可能地节省体力。假定每个果子重量都为1，并且已知果子的种类数和每种果子的数目，你的任务是设计出合并的次序方案，使多多耗费的体力最少，并输出这个最小的体力耗费值。 例如有3种果子，数目依次为1，2，9。可以先将1、2堆合并，新堆数目为3，耗费体力为3。接着，将新堆与原先的第三堆合并，又得到新的堆，数目为12，耗费体力为12。所以多多总共耗费体力=3+12=15。可以证明15为最小的体力耗费值-In an orchard, a lot has shot down all the fruit, and of different types of fruit into a different pile. Decided to put all the fruit of a lot of synthetic pile. Each merger, a lot can be merged together two piles of fruit, equal to two piles of physical consumption of fruit and weight. It can be seen, all the fruit through the n-1 times after the merger, on the left a pile of. When a lot of fruit in the combined strength equal to the total consumption of each of the merger and the physical consumption. Because these also make great efforts to move the fruit home, so when a lot of fruit in the merger as much as possible to save energy. Assume that each fruit weight is 1, and the number of species known to fruit and the number of each type of fruit, your task is to design a combined order of programs, so a lot of physical least cost and physical output of the minimum cost value. For example, there are three kinds of fruit, followed by the number 1,2,9. 1,2 heap can be first merged, the
Platform: |
Size: 1024 |
Author: yanSS |
Hits:
Description: 将原图像看做是自相关及其功率谱是各向同性的一阶马尔可夫过程,采用基于方向微分的运动模糊方向鉴别方法，对运动模糊图像进行方向性的高通滤波(方向微分),当滤波方向为运动模糊方向时 ,由于此方向模糊图像对应的高频成分最少,高通滤波(方向微分)使模糊图像能量损失最大,得到的微分图像灰度值（双线性插值）之和必然最小.所以方向微分得到的图像灰度值之和中的最小值对应的方向即为运动模糊的方向-The original image as is the autocorrelation and power spectrum is isotropic first-order Markov process, the use of motion blur based on the direction of the direction of the differential method of identifying the direction of motion blurred images of high-pass filter (the direction of derivative) When the filter direction is the direction of motion blur, due to the blurred image corresponding to the direction of high frequency components at least, high pass filter (the direction of derivative) to the maximum energy loss of blurred images, the resulting differential image intensity value (bilinear interpolation) of and the inevitable minimum. So the direction of differential image intensity values obtained and the minimum in the corresponding direction is the direction of motion blur
Platform: |
Size: 29696 |
Author: ouyangsir |
Hits:
Description: 流放圆饼规则 当圆饼移动完毕而总势能又不为0时，根据拟人策略，需要流放一个圆饼再重新启动移动规则直到下一次完毕。而到底流放的是相对挤压弹性势能最大的圆饼还是绝对挤压弹性势能最小的圆饼则要取决于上次流放的圆饼了。怎么确定相对挤压弹性势能最大的圆饼和绝对挤压弹性势能最小的圆饼以及如何控制流放的圆饼？-Pie rules exile movement is completed when the round cake and the total potential energy is not 0, according to the proposed one strategy, you need to exile a round cake and then restart the rule until the next move is completed. And in the end of exile is the greatest relative extrusion elastic potential energy pie is absolutely the smallest extrusion elastic potential energy will have to depend on the last round cake round cake of exile. How to determine the relative extrusion elastic potential energy and the absolute maximum squeeze round cake round cake elastic potential energy minimum, and how to control the exile of the round cake?
Platform: |
Size: 1024 |
Author: jerry |
Hits:
Description: 基于最小能量统计的语音增强算法，使用vs2010编译器，测试文件使用dat语音文件-Statistics based on minimum energy speech enhancement algorithm using vs2010 compiler, test files using dat voice files
Platform: |
Size: 2048 |
Author: 孙航 |
Hits:
Description: 使用CW方程，使用最小能量，采用脉冲推力，实现在一天内两航天器的交会对接。本质上就是一个交会轨道优化问题，由给定的条件优化选取设计变量，使目标函数得到最优值。-Using the CW equation, use the minimum energy, the use of pulse thrust, to achieve in a day two spacecraft rendezvous and docking. Is essentially an intersection orbit optimization problem, by the given conditions to optimize the selection of design variables, so that the objective function to get the optimal value.
Platform: |
Size: 3072 |
Author: 胡云鹏 |
Hits:
Description: This script provides an scheduling algorithm to minimize the energy consumption of a datacenter based on the minimum heat recirculation method.
Platform: |
Size: 5120 |
Author: Freerk
|
Hits:
Description: 在马尔科夫随机场中，用ICM,LBP,GC,TRW四种方法实现能量最小(Using ICM,LBP,GC,TRW to realize the minimum energy in MRF)
Platform: |
Size: 58368 |
Author: sisisi |
Hits:
Description: 澳洲空调器标准
澳大利亚/新西兰标准（TM）
能效标签及最小能耗的标准(Australian air-conditioner standards
Australian/New Zealand Standard(TM)
Performance of electrical appliances—
Part 2: Energy labelling and minimum
energy performance standard (MEPS)
)
Platform: |
Size: 514048 |
Author: sinly |
Hits: